Random self-reducibility

Results: 12



#Item
1Cryptography / Polynomials / Probabilistic complexity theory / IP / Commitment scheme / NP / Interactive proof system / Zero-knowledge proof / Polynomial interpolation / Polynomial / Random self-reducibility / Permutation polynomial

Locally Random Reductions: Improvements and Applications  D. Beavery J. Feigenbaumz J. Kilianx September 1, 1995

Add to Reading List

Source URL: cs-www.cs.yale.edu

Language: English - Date: 2001-10-24 10:55:38
2Computational complexity theory / Theory of computation / Complexity classes / Structural complexity theory / Conjectures / Probability distributions / NP / Polynomial hierarchy / IP / P versus NP problem / PP / P

ON THE RANDOM-SELF-REDUCIBILITY OF COMPLETE SETS JOAN FEIGENBAUMy AND LANCE FORTNOWz

Add to Reading List

Source URL: cs-www.cs.yale.edu

Language: English - Date: 2001-10-25 12:45:35
3

RANDOM SELF-REDUCIBILITY PROPERTIES OF LEARNING PROBLEMS OVER BURNSIDE GROUPS OF EXPONENT 3 Nelly Fazio∗ Computer Science Department The City College of CUNY e-mail:

Add to Reading List

Source URL: www.cs.stevens.edu

Language: English - Date: 2013-03-13 10:20:02
    4Homomorphic encryption / Post-quantum cryptography / Learning with errors / Quantum computer / Zero-knowledge proof / Public-key cryptography / RSA / Random self-reducibility / Oblivious transfer / Cryptography / Lattice-based cryptography / Lattice problem

    Cryptography from Post-Quantum Assumptions Raza Ali Kazmi Doctor of Philosophy

    Add to Reading List

    Source URL: eprint.iacr.org

    Language: English - Date: 2015-04-18 18:23:29
    5Paillier cryptosystem / Homomorphic encryption / Goldwasser–Micali cryptosystem / Learning with errors / Oblivious transfer / RSA / XTR / ElGamal encryption / Random self-reducibility / Cryptography / Public-key cryptography / Electronic commerce

    Oblivious Transfer from weakly Random Self-Reducible Public-Key Cryptosystem Claude Cr´epeau ? , Raza Ali Kazmi ?

    Add to Reading List

    Source URL: eprint.iacr.org

    Language: English - Date: 2015-04-21 15:33:43
    6Complexity classes / NP / P versus NP problem / Randomized algorithm / PP / Random self-reducibility / RP / P / Normal distribution / Theoretical computer science / Computational complexity theory / Applied mathematics

    Chicago Journal of Theoretical Computer Science The MIT Press Volume 1999, Article 4 25 March 1999 ISSN 1073–0486. MIT Press Journals, Five Cambridge Center, Cambridge,

    Add to Reading List

    Source URL: cjtcs.cs.uchicago.edu

    Language: English - Date: 1999-04-30 15:06:50
    7Finite fields / Computability theory / Cryptographic protocols / Computational complexity theory / Diffie–Hellman problem / XTR / Random self-reducibility / Oracle machine / Reduction / Theoretical computer science / Applied mathematics / Mathematics

    Irreducibility to the One-More Evaluation Problems: More May Be Less Daniel R. L. Brown∗ June 9, 2010 Abstract

    Add to Reading List

    Source URL: eprint.iacr.org

    Language: English - Date: 2010-06-09 14:57:08
    8Computational complexity theory / Probabilistic complexity theory / Analysis of algorithms / Randomized algorithm / Communication complexity / Factorial / Logarithm / SL / Random self-reducibility / Theoretical computer science / Mathematics / Applied mathematics

    The space complexity of approximating the frequency moments Noga Alon † Yossi Matias

    Add to Reading List

    Source URL: www.tau.ac.il

    Language: English - Date: 2002-02-21 20:13:33
    9Probabilistic complexity theory / Complexity classes / Computability theory / Oracle machine / Advantage / Randomized algorithm / Random self-reducibility / PP / Reduction / Theoretical computer science / Computational complexity theory / Applied mathematics

    Separation Results on the “One-More” Computational Problems Emmanuel Bresson1 , Jean Monnerat?2 , and Damien Vergnaud3 2 1

    Add to Reading List

    Source URL: www.ssi.gouv.fr

    Language: English - Date: 2012-11-06 05:29:19
    10Diffie–Hellman key exchange / Station-to-Station protocol / Diffie–Hellman problem / Key-agreement protocol / XTR / Advantage / Random self-reducibility / Public-key cryptography / Oracle machine / Cryptography / Cryptographic protocols / MQV

    An extended abstract of this work appears in Proceedings of the 5th International Conference (SCN ’06) (6 – 8 september 2006, Maiori, Italy) M. Yung Ed., Springer-Verlag, LNCS 4116, Pages 156–172. About the Securit

    Add to Reading List

    Source URL: www.ssi.gouv.fr

    Language: English - Date: 2012-11-06 05:29:21
    UPDATE